Algebraic Signal Processing Theory: Cooley–Tukey-Type Algorithms for Polynomial Transforms Based on Induction
نویسندگان
چکیده
منابع مشابه
Algebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for Polynomial Transforms Based on Induction
A polynomial transform is the multiplication of an input vector x ∈ C by a matrix Pb;α ∈ Cn×n; whose ðk;lÞth element is defined as plðαkÞ for polynomials plðxÞ ∈ C1⁄2x from a list b 1⁄4 fp0ðxÞ; : : : ; pn−1ðxÞg and sample points αk ∈ C from a list α 1⁄4 fα0; : : : ;αn−1g. Such transforms find applications in the areas of signal processing, data compression, and function interpolation. An import...
متن کاملAlgebraic Signal Processing Theory
This paper presents an algebraic theory of linear signal processing. At the core of algebraic signal processing is the concept of a linear signal model defined as a triple (A,M,Φ), where familiar concepts like the filter space and the signal space are cast as an algebra A and a module M, respectively, and Φ generalizes the concept of the z-transform to bijective linear mappings from a vector sp...
متن کاملAlgebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for Real DFTs
In this paper we systematically derive a large class of fast general-radix algorithms for various types of real discrete Fourier transforms (real DFTs) including the discrete Hartley transform (DHT) based on the algebraic signal processing theory. This means that instead of manipulating the transform definition, we derive algorithms by manipulating the polynomial algebras underlying the transfo...
متن کاملAlgebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for DCTs and DSTs
This paper presents a systematic methodology based on the algebraic theory of signal processing to classify and derive fast algorithms for linear transforms. Instead of manipulating the entries of transform matrices, our approach derives the algorithms by stepwise decomposition of the associated signal models, or polynomial algebras. This decomposition is based on two generic methods or algebra...
متن کاملFast algorithms for discrete polynomial transforms
Consider the Vandermonde-like matrix P := (Pk(cos jπ N ))j,k=0, where the polynomials Pk satisfy a three-term recurrence relation. If Pk are the Chebyshev polynomials Tk , then P coincides with CN+1 := (cos jkπ N )j,k=0. This paper presents a new fast algorithm for the computation of the matrixvector product Pa in O(N logN) arithmetical operations. The algorithm divides into a fast transform wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 2011
ISSN: 0895-4798,1095-7162
DOI: 10.1137/100805777